2ATAs make DLs easy

نویسندگان

  • Diego Calvanese
  • Giuseppe De Giacomo
  • Maurizio Lenzerini
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Giuseppe De Giacomo , Maurizio Lenzerini

In this paper we demonstrate that two-way alternating automata on infinite trees (2ATAs) provide a very elegant and effective formal tool for addressing reasoning in expressive DLs. Indeed, the encoding of a DL concept (to be checked for satisfiability) into an automaton (to be checked for non-emptiness) is: (i) intuitive, indeed, comparable to tableaux rules; (ii) modular, since each construct...

متن کامل

CP4DL: Constraint-based Reasoning for Expressive Description Logics

Description logics (DLs) are a family of logic-based knowledge representation formalisms, which provide underlying semantics for modern ontology languages such as OWL 2. Reasoners for DLs are mostly specialised algorithms, which can answer questions such as whether an ontology as a whole is consistent, whether a certain concept in an ontology can be non-empty, or whether one concept subsumes an...

متن کامل

How to use dynamic light scattering to improve the likelihood of growing macromolecular crystals.

Dynamic light scattering (DLS) has become one of the most useful diagnostic tools for crystallization. The main purpose of using DLS in crystal screening is to help the investigator understand the size distribution, stability, and aggregation state of macromolecules in solution. It can also be used to understand how experimental variables influence aggregation. With commercially available instr...

متن کامل

Reactive Dynamic Local Search algorithms for the Satisfiability Problem CPSC 532D Course Project Proposal

Stochastic Local Search (SLS) algorithms are of interest to a large number of research areas as well as business applications because they constitute some of the current best approaches to efficiently solve hard (NP-complete) combinatorial problems approximatively [1]. Satisfiability (SAT) problems, forming one of the most prominent type of NP-complete problems, are especially suitable for the ...

متن کامل

A Native Extensible XML Query Processor Towards Efficient and Effective MPEG-7 Querying

In recent years the production of massive amounts of visual information has led to the arrival of very large multimedia Digital Libraries (DLs). The key to support efficient search and management operations in such repositories is to exploit metadata information for digital media, such as MPEG7 [4] based ones, which seem to be the most widely accepted. The underlying XML syntax, together with t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002